Selecting a hashing algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selecting a Hashing Algorithm

Hashing is so commonly used in computing that one might expect hash functions to be well understood, and that choosing a suitable function should not be difficult. The results of investigations into the performance of some widely used hashing algorithms are presented and it is shown that some of these algorithms are far from optimal. Recommendations are made for choosing a hashing algorithm and...

متن کامل

A Distributed Hashing Algorithm

Dealing with a huge amount of data nowadays increase the need to distribute this data among cooperated servers in order to increase its availability and the performance of accessing and retrieving data. Rapidly growing networks implies that future files and database system are likely to be constructed as networked clusters of Distributed nodes and algorithms should be devised to work in this en...

متن کامل

A secured Cryptographic Hashing Algorithm

Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the origi...

متن کامل

A practical perfect hashing algorithm

Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has particular theoretical and practical importance. The algorithm of Fredman, Komll os, and Szemer edi 8], augmented by Dietzfelbinger, et al. 7], is a simple perfect hashing scheme that has not seen extensive use due to poor practical performance. In this paper, we develop modii...

متن کامل

ERINDALE: A Polynomial Based Hashing Algorithm

The aim of this article is to describe a new hash algorithm using polynomials over finite fields. In software, it runs at speeds comparable to SHA-384. Hardware implementation of a slightly modified version of the algorithm presented here runs at significantly faster speeds, namely at 2 Gbits/sec on an FPGA Virtex V of frequency 300 MHz. Modelling suggests that this speed can be increased to 3....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Software: Practice and Experience

سال: 1990

ISSN: 0038-0644,1097-024X

DOI: 10.1002/spe.4380200207